| 翻訳と辞書 |
| High (computability) ： ウィキペディア英語版 |
High (computability)
In computability theory, a Turing degree () is high if it is computable in 0′, and the Turing jump () is 0′′, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0′ (Soare 1987:71).
Similarly, a degree is ''high n'' if its n'th jump is the (n+1)'st jump of 0. Even more generally, a degree d is ''generalized high n'' if its n'th jump is the n'th jump of the join of d with 0′.
==See also==
Low (computability)
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「High (computability)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|